Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe intersection")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 154

  • Page / 7
Export

Selection :

  • and

The frame dimension and the complete overlap dimension of a graphSTEIF, J. E.Journal of graph theory. 1985, Vol 9, Num 2, pp 285-299, issn 0364-9024Article

Irrepresentability by multiple intersection, or why the interval number is unboundedSCHEINERMAN, E. R.Discrete mathematics. 1985, Vol 55, Num 2, pp 195-211, issn 0012-365XArticle

Edge and vertex intersection of paths in a treeGOLUMBIC, M. C; JAMISON, R. E.Discrete mathematics. 1985, Vol 55, Num 2, pp 151-159, issn 0012-365XArticle

Grid intersection graphs and boxicityBELLANTONI, S; BEN-ARROYO HARTMAN, I; PRZYTYCKA, T et al.Discrete mathematics. 1993, Vol 114, Num 1-3, pp 41-49, issn 0012-365XConference Paper

The edge intersection graphs of paths in a treeGOLUMBIC, M. C; JAMISON, R. E.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 1, pp 8-22, issn 0095-8956Article

Ordres et géométrie plane : application au nombre de sauts = Orders and plane geometry : application to the jump numberCeroi, Stephan; Habib, Michel.2000, 116 p.Thesis

String graphs. I, The number of critical nonstring graphs is infiniteKRATOCHVIL, J.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 1, pp 53-66, issn 0095-8956Article

General results on tolerance intersection graphsJACOBSON, M. S; MCMORRIS, F. R; SCHEINERMAN, E. R et al.Journal of graph theory. 1991, Vol 15, Num 6, pp 573-577, issn 0364-9024Article

Sphere of influence graphs: edge density and clique sizeMICHAEL, T. S; QUINT, T.Mathematical and computer modelling. 1994, Vol 20, Num 7, pp 19-24, issn 0895-7177Article

Subtree and substar intersection numbersYI-WU CHANG; JACOBSON, M. S; MONMA, C. L et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 205-220, issn 0166-218XArticle

φ-threshold and φ-tolerance chain graphsJACOBSON, M. S; LEHEL, J; LESNIAK, L. M et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 191-203, issn 0166-218XArticle

Subspace intersection graphsLAISON, JoshuaD; YULANQING.Discrete mathematics. 2010, Vol 310, Num 23, pp 3413-3416, issn 0012-365X, 4 p.Article

Interval bigraphs are unit grid intersection graphsRICHERBY, David.Discrete mathematics. 2009, Vol 309, Num 6, pp 1718-1719, issn 0012-365X, 2 p.Article

Indifference digraphs: a generalization of indifference graphs and semiordersSEN, M; SANYAL, B. K.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 157-165, issn 0895-4801Article

Fuzzy line graphsMORDESON, J. N.Pattern recognition letters. 1993, Vol 14, Num 5, pp 381-384, issn 0167-8655Article

Enumeration of acyclic walks in a graphBABIC, D; GRAOVAC, A.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 117-123, issn 0166-218XArticle

Diamond-free circle graphs are Helly circleDALIGAULT, Jean; GONCALVES, Daniel; RAO, Michaël et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 845-849, issn 0012-365X, 5 p.Article

The set of values of b for which there exist block designs with b blocksABBOTT, H. L; HARE, D. R.Discrete mathematics. 2005, Vol 290, Num 2-3, pp 275-282, issn 0012-365X, 8 p.Article

A characterization of intersection graphs of the maximal rectangles of a polyominoMAIRE, F.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 211-214, issn 0012-365XArticle

An intersection graph of straight linesTHOMASSEN, Carsten.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 359-360, issn 0012-365X, 2 p.Article

The total interval number of a graph. I: Fundamental classesKRATZKE, T. M; WEST, D. B.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 145-156, issn 0012-365XArticle

COMPARABILITY GRAPHS AND INTERACTION GRAPHSGOLUMBIC MC; ROTEM D; URRUTIA J et al.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 37-46; BIBL. 17 REF.Article

CIRCULAR PERMUTATION GRAPHSROTEM D; URRUTIA J.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 4; PP. 429-437; BIBL. 14 REF.Article

COMPUTING THE BOXICITY OF A GRAPH BY COVERING ITS COMPLEMENT BY COINTERVAL GRAPHSCOZZENS MB; ROBERTS FS.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 3; PP. 217-228; BIBL. 24 REF.Article

BIPARTITE INTERSECTION GRAPHSHARARY F; KABELL JA; MCMORRIS FR et al.1982; COMMENTAT. MATH. UNIV. CAROL.; ISSN 0323-0171; CSK; DA. 1982; VOL. 23; NO 4; PP. 739-745; BIBL. 9 REF.Article

  • Page / 7